Coding Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems
نویسندگان
چکیده
Consider transmitting two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multi-terminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side, both decoders need to reconstruct the common source, but only one decoder needs to reconstruct the private source. We hence refer to this system by the asymmetric 2-user source-channel system. In this work, we derive a universally achievable joint source-channel coding (JSCC) error exponent pair for the 2-user system by using a technique which generalizes Csiszár’s method [8] for the point-to-point (single-user) discrete memoryless source-channel system. We next investigate the largest convergence rate of asymptotic exponential decay of the system (overall) probability of erroneous transmission, i.e., the system JSCC error exponent. We obtain lower and upper bounds for the exponent. As a consequence, we establish the JSCC theorem with single letter characterization.
منابع مشابه
Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems
We investigate the joint source–channel coding (JSCC) excess distortion exponent (the exponent of the probability of exceeding a prescribed distortion level) for some memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryles...
متن کاملOn the Joint Source-Channel Coding Excess Distortion Exponent for Memoryless Continuous-Alphabet Systems
We investigate the joint source-channel coding (JSCC) excess distortion exponent EJ (the exponent of the probability of exceeding a prescribed distortion level) for memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for EJ for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryle...
متن کاملAnalogy and duality between random channel coding and lossy source coding
Here we write in a unified fashion (using “R(P,Q,D)” [1]) the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding error exponent can be viewed as an encoding success exponent in lossy source coding, and the channel correct-decoding exponent can be viewed as an encoding ...
متن کاملMultiuser Coding Techniques for Mismatched Decoding
This paper studies multiuser coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, error exponents are obtained which are tight with respect to the ensemble average, and positive within the interior of Lapidoth’s achievable rate region. In the special case of maximum-likelihood decoding, the ensembl...
متن کاملOn the Joint Source-Channel Coding Error Exponent for Discrete Memoryless Systems: Computation and Comparison with Separate Coding
We investigate the computation of Csiszár’s bounds for the joint source-channel coding (JSCC) error exponent, EJ , of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007